Benchmarking Message Queues

نویسندگان

چکیده

Message queues are a way for different software components or applications to communicate with each other asynchronously by passing messages through shared buffer. This allows sender send message without needing wait an immediate response from the receiver, which can help improve system’s performance, reduce latency, and allow operate independently. In this paper, we compared evaluated performance of four popular queues: Redis, ActiveMQ Artemis, RabbitMQ, Apache Kafka. The aim study was provide insights into strengths weaknesses technology practitioners choose most appropriate solution their use case. We primarily in terms latency throughput. Our experiments were conducted using diverse array workloads test under various scenarios. enables evaluate systems one that best meets needs. results show has its own pros cons. Specifically, Redis performed whereas Kafka significantly outperformed three technologies optimal choice depends on specific requirements paper presents valuable researchers working queues. Furthermore, our provided JSON format as supplement paper.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Survey of Distributed Message Broker Queues

This paper surveys the message brokers that are in vogue today for distributed communication. Their primary goal is to facilitate the construction of decentralized topologies without single points of failure, enabling fault tolerance and high availability. These characteristics make them optimal for usage within distributed architectures. However, there are multiple protocols built to achieve t...

متن کامل

Message Queues. Three Patterns for Asynchronous Information Exchange

Information exchange between concurrent processing elements like threads or tasks is one of the fundamental issues in information processing systems. In many cases, this information transfer needs to occur asynchronously, i.e. the ‘consumer’ must be enabled to receive the information at some later point in time than the ‘producer’ provides it. Of course, this may apply to data transfer within a...

متن کامل

Undecidability of accordance for open systems with unbounded message queues

We study asynchronously communicating open systems modeled as Petri nets with an interface. An accordance preorder describes when one open system can be safely replaced by another open system without affecting some behavioral property of the overall system. Although accordance is decidable for several behavioral properties if we assume a previously known bound on the maximal number of pending m...

متن کامل

Designing a Workload Scenario for Benchmarking Message-Oriented Middleware

Message-oriented middleware (MOM) is increasingly adopted as an enabling technology for modern informationdriven applications like event-driven supply chain management, transport information monitoring, stock trading and online auctions to name just a few. There is a strong interest in the commercial and research domains for a standardized benchmark suite for evaluating the performance and scal...

متن کامل

Benchmarking Concurrent Priority Queues: Performance of k-LSM and Related Data Structures

A number of concurrent, relaxed priority queues have recently been proposed and implemented. Results are commonly reported for a throughput benchmark that uses a uniform distribution of keys drawn from a large integer range, and mostly for single systems. We have conducted more extensive benchmarking of three recent, relaxed priority queues on four different types of systems with different key ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Telecom

سال: 2023

ISSN: ['2673-4001']

DOI: https://doi.org/10.3390/telecom4020018